Predicting Redemption Probability of Gift Cards Combining Rating and Demographic Data in a Hybrid User Based Recommender System

ثبت نشده
چکیده

Recommender systems try to facilitate the decision making process of users, by recommending products such as movies, music and news articles. This work uses a user based recommender system to predict redemption probabilities of different gift cards. That is, the probability that a user redeems a gift card in a store, given that he or she receives it. This work is a base for ranking gift cards in the future. Two collaborative filtering algorithms are evaluated, both based on neighbour recommender methods. The data are provided by the digital gift giving company Wrapp. The nearest neighbours are chosen by similarity, based on the rating of gift cards and the demographic data of the users. The result shows that it is possible to predict redemption probabilities of gift cards with this data. It also shows that it is important to include certain user behaviors when predicting the redemption probabilities. One such example is if a user tends to redeem more or less gift cards than other users. This work does not explicitly show that demographic data are improving the result, compared to a rating data approach, even though the results with demographic data seem promising.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Recommender System Based on Variance Item Rating

K-nearest neighbors (KNN) based recommender systems (KRS) are among the most successful recent available recommender systems. These methods involve in predicting the rating of an item based on the mean of ratings given to similar items, with the similarity defined by considering the mean rating given to each item as its feature. This paper presents a KRS developed by combining the following app...

متن کامل

Design a Hybrid Recommender System Solving Cold-start Problem Using Clustering and Chaotic PSO Algorithm

One of the main challenges of increasing information in the new era, is to find information of interest in the mass of data. This important matter has been considered in the design of many sites that interact with users. Recommender systems have been considered to resolve this issue and have tried to help users to achieve their desired information; however, they face limitations. One of the mos...

متن کامل

Use of Semantic Similarity and Web Usage Mining to Alleviate the Drawbacks of User-Based Collaborative Filtering Recommender Systems

  One of the most famous methods for recommendation is user-based Collaborative Filtering (CF). This system compares active user’s items rating with historical rating records of other users to find similar users and recommending items which seems interesting to these similar users and have not been rated by the active user. As a way of computing recommendations, the ultimate goal of the user-ba...

متن کامل

Evolutionary User Clustering Based on Time-Aware Interest Changes in the Recommender System

The plenty of data on the Internet has created problems for users and has caused confusion in finding the proper information. Also, users' tastes and preferences change over time. Recommender systems can help users find useful information. Due to changing interests, systems must be able to evolve. In order to solve this problem, users are clustered that determine the most desirable users, it pa...

متن کامل

Designing a trust-based recommender system in Social Rating Networks

One of the most common styles of business today is electronic business, since it is considered as a principal mean for financial transactions among advanced countries. In view of the fact that due to the evolution of human knowledge and the increase of expectations following that, traditional marketing in electronic business cannot meet current generation’s needs, in order to survive, organizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012